Neural representation of a time optimal, constant acceleration rendezvous

نویسندگان

چکیده

We train neural models to represent both the optimal policy (i.e. thrust direction) and value function time of flight) for a optimal, constant acceleration low-thrust rendezvous. In cases we develop make use data augmentation technique call backward generation examples. are thus able produce work with large dataset fully exploit benefit employing deep learning framework. achieve, in all cases, accuracies resulting successful rendezvous (simulated following learned policy) flight predictions (using function). find that residuals as small few m/s, well within possibility spacecraft navigation $\Delta V$ budget, achievable velocity at also that, on average, absolute error predict from any orbit asteroid belt an Earth-like is (less than 4\%) interest practical uses, example, during preliminary mission design phases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rendezvous with constant memory

We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...

متن کامل

Asymptotically Optimal Deterministic Rendezvous

In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...

متن کامل

On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...

متن کامل

Rendezvous of Two Robots with Constant Memory

We study the impact that persistent memory has on the classical rendezvous problem of two mobile computational entities, called robots, in the plane. It is well known that, without additional assumptions, rendezvous is impossible if the entities are oblivious (i.e., have no persistent memory) even if the system is semi-synchronous (SSynch). It has been recently shown that rendezvous is possible...

متن کامل

The neural representation of time.

This review summarizes recent investigations of temporal processing. We focus on motor and perceptual tasks in which crucial events span hundreds of milliseconds. One key question concerns whether the representation of temporal information is dependent on a specialized system, distributed across a network of neural regions, or computed in a local task-dependent manner. Consistent with the speci...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Astronautica

سال: 2023

ISSN: ['1879-2030', '0094-5765']

DOI: https://doi.org/10.1016/j.actaastro.2022.08.045